Average Performance of Quasi Monte Carlo Methods for Global Optimization 3 VAN DER CORPUT SEQUENCES
نویسنده
چکیده
In this paper we compare the average performance of one class of low-discrepancy quasi-Monte Carlo sequences for global optimization. Weiner measure is assumed as the probability prior on all optimized functions. We show how to construct van der Corput sequences and we prove their consistency. Numerical experimentation shows that the van der Corput sequence in base 2 has a better average performance.
منابع مشابه
Golden Ratio Sequences for Low-Discrepancy Sampling
Most classical constructions of low-discrepancy point sets are based on generalizations of the one-dimensional binary van der Corput sequence whose implementation requires non-trivial bit-operations. As an alternative we introduce the quasi-regular golden ratio sequences which are based on the fractional part of successive integer multiples of the golden ratio. By leveraging results from number...
متن کاملA good permutation for one-dimensional diaphony
In this article we focus on two aspects of one-dimensional diaphony F.S b ; N / of generalised van der Corput sequences in arbitrary bases. First we give a permutation with the best distribution behaviour concerning the diaphony known so far. We improve a result of Chaix and Faure from 1993 from a value of 1:31574 : : : for a permutation in base 19 to 1:13794 : : : for our permutation in base 5...
متن کاملDiscrepancy bounds for low-dimensional point sets
The class of (t,m, s)-nets and (t, s)-sequences, introduced in their most general form by Niederreiter, are important examples of point sets and sequences that are commonly used in quasi-Monte Carlo algorithms for integration and approximation. Low-dimensional versions of (t,m, s)-nets and (t, s)-sequences, such as Hammersley point sets and van der Corput sequences, form important sub-classes, ...
متن کاملLow Discrepancy Constructions in the Triangle
Most quasi-Monte Carlo research focuses on sampling from the unit cube. Many problems, especially in computer graphics, are defined via quadrature over the unit triangle. Quasi-Monte Carlo methods for the triangle have been developed by Pillards and Cools (2005) and by Brandolini et al. (2013). This paper presents two QMC constructions in the triangle with a vanishing discrepancy. The first is ...
متن کاملLOW DISCREPANCY CONSTRUCTIONS IN THE TRIANGLE By
Most quasi-Monte Carlo research focuses on sampling from the unit cube. Many problems, especially in computer graphics, are defined via quadrature over the unit triangle. Quasi-Monte Carlo methods for the triangle have been developed by Pillards and Cools (2005) and by Brandolini et al. (2013). This paper presents two QMC constructions in the triangle with a vanishing discrepancy. The first is ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998